A simple algorithm for edge-coloring bipartite multigraphsALON, Noga.Information processing letters. 2003, Vol 85, Num 6, pp 301-302, issn 0020-0190, 2 p.Article

Voting paradoxes and digraphs realizationsALON, Noga.Advances in applied mathematics (Print). 2002, Vol 29, Num 1, pp 126-135, issn 0196-8858Article

THE BRUNN―MINKOWSKI INEQUALITY AND NONTRIVIAL CYCLES IN THE DISCRETE TORUSALON, Noga; FELDHEIM, Ohad N.SIAM journal on discrete mathematics (Print). 2011, Vol 24, Num 3, pp 892-894, issn 0895-4801, 3 p.Article

Optimal Monotone EncodingsALON, Noga; HOD, Rani.IEEE transactions on information theory. 2009, Vol 55, Num 3, pp 1343-1353, issn 0018-9448, 11 p.Article

EVERY MONOTONE GRAPH PROPERTY IS TESTABLEALON, Noga; SHAPIRA, Asaf.SIAM journal on computing (Print). 2009, Vol 38, Num 2, pp 505-522, issn 0097-5397, 18 p.Article

The shannon capacity of a graph and the independence numbers of its powersALON, Noga; LUBETZKY, Eyal.IEEE transactions on information theory. 2006, Vol 52, Num 5, pp 2172-2176, issn 0018-9448, 5 p.Article

Learing a hidden subgraphALON, Noga; ASODI, Vera.SIAM journal on discrete mathematics (Print). 2005, Vol 18, Num 4, pp 697-712, issn 0895-4801, 16 p.Article

SPARSE BALANCED PARTITIONS AND THE COMPLEXITY OF SUBGRAPH PROBLEMSALON, Noga; MARX, Daniel.SIAM journal on discrete mathematics (Print). 2011, Vol 25, Num 1-2, pp 631-644, issn 0895-4801, 14 p.Article

Hardness of fully dense problemsAILON, Nir; ALON, Noga.Information and computation (Print). 2007, Vol 205, Num 8, pp 1117-1129, issn 0890-5401, 13 p.Article

Testing satisfiabilityALON, Noga; SHAPIRA, Asaf.Journal of algorithms (Print). 2003, Vol 47, Num 2, pp 87-103, issn 0196-6774, 17 p.Article

Matrix Sparsification and Nested Dissection over Arbitrary FieldsALON, Noga; YUSTER, Raphael.Journal of the Association for Computing Machinery. 2013, Vol 60, Num 4, issn 0004-5411, 25.1-25.18Article

Tracing many users with almost no rate penaltyALON, Noga; ASODI, Vera.IEEE transactions on information theory. 2007, Vol 53, Num 1, pp 437-439, issn 0018-9448, 3 p.Article

Testing k-colorabilityALON, Noga; KRIVELEVICH, Michael.SIAM journal on discrete mathematics (Print). 2002, Vol 15, Num 2, pp 211-227, issn 0895-4801Article

Hardness of edge-modification problemsALON, Noga; STAV, Uri.Theoretical computer science. 2009, Vol 410, Num 47-49, pp 4920-4927, issn 0304-3975, 8 p.Article

GRAPH POWERS, DELSARTE, HOFFMAN, RAMSEY, AND SHANNONALON, Noga; LUBETZKY, Eyal.SIAM journal on discrete mathematics (Print). 2008, Vol 21, Num 2, pp 329-348, issn 0895-4801, 20 p.Article

Typical Peak Sidelobe Level of Binary SequencesALON, Noga; LITSYN, Simon; SHPUNT, Alexander et al.IEEE transactions on information theory. 2010, Vol 56, Num 1, pp 545-554, issn 0018-9448, 10 p.Article

An isoperimetric inequality in the universal cover of the punctured planeALON, Noga; PINCHASI, Adi; PINCHASI, Rom et al.Discrete mathematics. 2008, Vol 308, Num 23, pp 5691-5701, issn 0012-365X, 11 p.Article

A CHARACTERIZATION OF THE (NATURAL) GRAPH PROPERTIES TESTABLE WITH ONE-SIDED ERRORALON, Noga; SHAPIRA, Asaf.SIAM journal on computing (Print). 2008, Vol 37, Num 6, pp 1703-1727, issn 0097-5397, 25 p.Article

STABLE KNESER HYPERGRAPHS AND IDEALS IN N WITH THE NIKODYM PROPERTYALON, Noga; DREWNOWSKI, Lech; LUCZAK, Tomasz et al.Proceedings of the American Mathematical Society. 2009, Vol 137, Num 2, pp 467-471, issn 0002-9939, 5 p.Article

TESTING TRIANGLE-FREENESS IN GENERAL GRAPHSALON, Noga; KAUFMAN, Tali; KRIVELEVICH, Michael et al.SIAM journal on discrete mathematics (Print). 2009, Vol 22, Num 2, pp 786-819, issn 0895-4801, 34 p.Article

Almost k-wise independence versus k-wise independenceALON, Noga; GOLDREICH, Oded; MANSOUR, Yishay et al.Information processing letters. 2003, Vol 88, Num 3, pp 107-110, issn 0020-0190, 4 p.Article

Sparse universal graphsALON, Noga; ASODI, Vera.Journal of computational and applied mathematics. 2002, Vol 142, Num 1, pp 1-11, issn 0377-0427Article

TURÁN'S THEOREM IN THE HYPERCUBEALON, Noga; KREICIH, Anja; SZABO, Tibor et al.SIAM journal on discrete mathematics (Print). 2008, Vol 21, Num 1, pp 66-72, issn 0895-4801, 7 p.Article

Approximating the maximum clique minor and some subgraph homeomorphism problemsALON, Noga; LINGAS, Andrzej; WAHLEN, Martin et al.Theoretical computer science. 2007, Vol 374, Num 1-3, pp 149-158, issn 0304-3975, 10 p.Article

Page / 3